Method and device for encoding or decoding video

ABSTRACT

Disclosed herein is a method for decoding a video including determining a coding unit to be decoded by block partitioning, decoding prediction syntaxes for the coding unit, the prediction syntaxes including a skip flag indicating whether the coding unit is encoded in a skip mode, after the decoding of the prediction syntaxes, decoding transform syntaxes including a transformation/quantization skip flag and a coding unit cbf, wherein the transformation/quantization skip flag indicates whether inverse transformation, inverse quantization, and at least part of in-loop filterings are skipped, and the coding unit cbf indicates whether all coefficients in a luma block and two chroma blocks constituting the coding unit are zero, and reconstructing the coding unit based on the prediction syntaxes and the transform syntaxes.

CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation of U.S. patent applicationSer. No. 16/960,114, filed on Jan. 25, 2021, which a national stagefiling under 35 U.S.C § 371 of PCT application number PCT/KR2019/000136filed on Jan. 4, 2019 which is based upon and claims the benefit ofpriorities to Korean Patent Application No. 10-2018-0001728, filed onJan. 5, 2018 and Korean Patent Application No. 10-2018-0066664, filed onJun. 11, 2018, in the Korean Intellectual Property Office, which areincorporated herein in their entireties by reference.

TECHNICAL FIELD

The present disclosure relates to encoding and decoding of a video. Inone aspect, the present disclosure relates to encoding or decodingsyntaxes for a coding unit that is a basic unit of encoding.

BACKGROUND ART

Since the volume of video data is larger than that of voice data orstill image data, storing or transmitting video data without compressionrequires a lot of hardware resources including memory. Accordingly, instoring or transmitting video data, the video data is compressed usingan encoder so as to be stored or transmitted. Then, a decoder receivesthe compressed video data, and decompresses and reproduces the videodata. Compression techniques for such video include H.264/AVC and HighEfficiency Video Coding (HEVC), which was established in early 2013 andimproved coding efficiency over H.264/AVC by about 40%.

FIG. 1 is a diagram illustrating block partitioning in HEVC.

In HEVC, one picture is split into a plurality of coding tree units(CTUs) of a square shape, and each CTU is recursively split into aplurality of coding units (CUs) of a square shape by a quadtreestructure. When a CU, which is a basic unit of encoding, is determined,the CU is split into one or more prediction units (PUs) and predicted ona PU-by-PU basis. Splitting the CU into PUs is performed by selectingone splitting type having good coding efficiency from among multiplesplitting types. An encoding apparatus encodes prediction syntaxes foreach PU such that a decoding apparatus may predict each PU in the samemanner as the encoding apparatus.

In addition, the CU is split into one or more transform units (TUs) by aquadtree structure, and residual signals, which are differences betweenactual pixels and predicted pixels, are transformed using the size ofthe TU. Syntaxes for transformation are encoded on a TU-by-TU basis andtransmitted to the decoding apparatus.

As described above, HEVC has a complex block partitioning structure,such as partitioning of a CTU into CUs, partitioning of a CU into PUs,and partitioning of a CU into TUs. Accordingly, the CU, the PU, and theTU may be blocks having different sizes. In this block partitioningstructure of HEVC, it is necessary to separately encode related syntaxesfor a CU, and PUs and TUs in the CU. In HEVC, syntaxes for a CU areinitially encoded. Then, the CU invokes each PU to encode syntaxes foreach PU, and also invokes each TU to encode syntaxes for each TU.

In order to address the complexity of the block partitioning structureand syntax structure, a block partitioning technique of splitting a CTUinto CUs and then using each CU as a PU and a TU is newly discussed. Inthis new partitioning structure, when a CU is determined, prediction andtransformation are performed in the size of the CU without additionalpartitioning. That is, the CU, the PU and the TU are the same block. Theintroduction of the new partitioning structure requires a new structurefor encoding syntaxes for the CU.

DISCLOSURE Technical Problem

In order to meet the requirement, one aspect of the present inventionproposes a new structure for encoding or decoding syntaxes for a codingunit.

SUMMARY

In accordance with one aspect of the present disclosure, provided is amethod for decoding a video including determining a coding unit to bedecoded by block partitioning, decoding prediction syntaxes for thecoding unit, the prediction syntaxes including a skip flag indicatingwhether the coding unit is encoded in a skip mode, after the decoding ofthe prediction syntaxes, decoding transform syntaxes including atransformation/quantization skip flag and a coding unit cbf, wherein thetransformation/quantization skip flag indicates whether inversetransformation, inverse quantization, and at least part of in-loopfilterings are skipped, and the coding unit cbf indicates whether allcoefficients in a luma block and two chroma blocks constituting thecoding unit are zero, and reconstructing the coding unit based on theprediction syntaxes and the transform syntaxes.

In accordance with another aspect of the present disclosure, provided isa video decoding apparatus including a decoder configured to determine acoding unit to be decoded by block partitioning, decode predictionsyntaxes for the coding unit, the prediction syntaxes including a skipflag indicating whether the coding unit is encoded in a skip mode, anddecode, after the decoding of the prediction syntaxes, transformsyntaxes for the coding unit including a transformation/quantizationskip flag and a coding unit cbf, wherein the transformation/quantizationskip flag indicates whether inverse transformation, inversequantization, and at least part of in-loop filterings are skipped, andthe coding unit cbf indicates whether all coefficients in a luma blockand two chroma blocks constituting the coding unit are zero, and areconstructor configured to reconstruct the coding unit based on theprediction syntaxes and the transform syntaxes.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram illustrating block partitioning in HEVC.

FIG. 2 is an exemplary block diagram of a video encoding apparatuscapable of implementing the techniques of the present disclosure.

FIG. 3 is an exemplary diagram of block partitioning using a QTBTstructure.

FIG. 4 is an exemplary diagram for a plurality of intra-predictionmodes.

FIG. 5 is an exemplary diagram of peripheral blocks of a current CU.

FIG. 6 is an exemplary block diagram of a video decoding apparatuscapable of implementing the techniques of the present disclosure.

FIG. 7 is an exemplary flowchart for decoding CU syntaxes according tothe present disclosure.

FIG. 8 is another exemplary flowchart for decoding CU syntaxes accordingto the present disclosure.

FIG. 9 is an exemplary flowchart for illustrating a process of decodingtransform syntaxes for respective luma and chroma components.

FIG. 10 is an exemplary flowchart for illustrating a method of decodingcbf for three components constituting a CU.

DETAILED DESCRIPTION

Hereinafter, some embodiments of the present invention will be describedin detail with reference to the accompanying drawings. It should benoted that, in adding reference numerals to the constituent elements inthe respective drawings, like reference numerals designate likeelements, although the elements are shown in different drawings.Further, in the following description of the present invention, adetailed description of known functions and configurations incorporatedherein will be omitted when it may make the subject matter of thepresent invention rather unclear.

FIG. 2 is an exemplary block diagram of a video encoding apparatuscapable of implementing techniques of the present disclosure.

The video encoding apparatus includes a block splitter 210, a predictor220, a subtractor 230, a transformer 240, a quantizer 245, an encoder250, an inverse quantizer 260, an inverse transformer 265, an adder 270,an in-loop filter 280, and a memory 290. Each element of the videoencoding apparatus may be implemented as a hardware chip, or may beimplemented as software, and one or more microprocessors may beimplemented to execute the functions of the software corresponding tothe respective elements.

One video is composed of a plurality of pictures. Each picture is splitinto a plurality of regions, and encoding is performed for each region.For example, one picture is split into one or more slices and/or tiles,and each slice or tile is split into one or more coding tree units(CTUs). In addition, each CTU is split into one or more coding units(CUs) by a tree structure. Information applied to each CU is coded asthe syntax of the CU, and information applied to CUs included in one CTUin common is coded as the syntax of the CTU. Information applied to allblocks in one slice in common is coded as the syntax of the slice, andinformation applied to all blocks constituting one picture is coded in apicture parameter set (PPS). Further, information referred to by aplurality of pictures in common is coded in a sequence parameter set(SPS). In addition, information referred to by one or more SPSs incommon is coded in a video parameter set (VPS).

The block splitter 210 determines the size of a coding tree unit (CTU).Information about the size of the CTU (CTU size) is encoded as syntax ofthe SPS or PPS and is transmitted to the video decoding apparatus. Theblock splitter 210 splits each picture constituting the video into aplurality of CTUs of a determined size, and then recursively splits theCTUs using a tree structure. A leaf node in the tree structure serves asa coding unit (CU), which is a basic unit of coding. The tree structuremay a QuadTree (QT) structure, in which a node (or parent node) is splitinto four sub-nodes (or child nodes) of the same size, a BinaryTree (BT)structure, in which a node is split into two sub-nodes, a TernaryTree(TT) structure, in which a node is split into three sub-nodes at a ratioof 1:2:1, or a structure employing one or more of the QT structure, theBT structure, and the TT structure. For example, a QuadTree plusBinaryTree (QTBT) structure may be used, or a QuadTree plus BinaryTreeTernaryTree (QTBTTT) structure may be used.

FIG. 3 is an exemplary diagram of block partitioning using a QTBTstructure. In FIG. 3, (a) illustrates partitioning a block by a QTBTstructure, and (b) represents the partitioning in a tree structure. InFIG. 3, the solid lines represent partitioning by the QT structure, andthe dotted lines represent partitioning by the BT structure. In FIG.3(b), regarding notation of layers, a layer expression withoutparentheses denotes a layer of QT, and a layer expression in parenthesesdenotes a layer of BT. In the BT structure represented by dotted lines,the numbers are the partitioning type information.

As shown in FIG. 3, a CTU may be initially split according to the QTstructure. The QT splitting may be repeated until the size of thesplitting block reaches the minimum block size MinQTSize of the leafnode allowed in QT. A first flag (QT_split_flag) indicating whether eachnode of the QT structure is split into four nodes of a lower layer isencoded by the encoder 250 and signaled to the video decoding apparatus.

When the leaf node of the QT is not greater than the maximum block size(MaxBTSize) of the root node allowed in the BT, it may be furtherpartitioned into the BT structure. The BT may have a plurality ofsplitting types. For example, in some examples, there may be twosplitting types, which are a type of horizontally splitting a block intotwo blocks of the same size (i.e., symmetric horizontal splitting) and atype of vertically splitting a block into two blocks of the same size(i.e., symmetric vertical splitting). A second flag (BT_split_flag)indicating whether each node of the BT structure is split into block ofa lower layer and splitting type information indicating the splittingtype are encoded by the encoder 250 and transmitted to the videodecoding apparatus. There may be an additional type of splitting a blockof a node into two asymmetric blocks. The asymmetric splitting type mayinclude a type of splitting a block into two rectangular blocks at asize ratio of 1:3, or a type of splitting a block of a node in adiagonal direction.

Alternatively, the QTBTTT structure may be used. In the QTBTTTstructure, a CTU may be initially split into a QT structure, and thenleaf nodes of the QT may be split into one or more of a BT structure ora TT structure. The TT structure may also have a plurality of splittingtypes. For example, regarding splitting, there may be two splittingtypes: one type is horizontally splitting a block of a correspondingnode into three blocks at 1:2:1 ratio (i.e., symmetric horizontalsplitting) and the other type is vertical splitting at 1:2:1 ratio(i.e., symmetric vertical splitting). In the case of QTBTTT, not only aflag indicating whether each node is split into blocks of a lower layerand splitting type information (or splitting direction information)indicating a splitting type (or a splitting direction), but alsosupplemental information for distinguishing whether the splittingstructure is a BT structure or a TT structure may be signaled to thevideo decoding apparatus.

CUs may have various sizes according to QTBT or QTBTTT splitting of aCTU. In the present disclosure, a CU is not further split for predictionor transformation. That is, the CU, PU, and TU are blocks that have thesame size and are present at the same position.

The predictor 220 predicts a CU to generate a prediction block. Thepredictor 220 predicts a luma component and a chroma componentconstituting the CU, respectively.

In general, CUs within a picture may each be predictively coded. Ingeneral, prediction of the CUs may be accomplished using anintra-prediction technique, which uses data from a picture containingthe CUs, or an inter-prediction technique, which uses data from apicture encoded before the picture containing the CUs. Inter-predictionincludes both unidirectional prediction and bidirectional prediction. Tothis end, the predictor 220 includes an intra-predictor 222 and aninter-predictor 224.

The intra-predictor 222 predicts pixels in the CU using pixels(reference samples) located around the CU in the current picture inwhich the CU is included. There is a plurality of intra-prediction modesaccording to the prediction directions. For example, as shown in FIG. 4,the plurality of intra-prediction modes may include non-directionalmodes, which may include a planar mode and a DC mode, and 65 directionalmodes. Peripheral pixels and an equation to be used are defineddifferently according to each prediction mode.

The intra-predictor 222 may determine an intra-prediction mode to beused in encoding the CU. In some examples, the intra-predictor 222 mayencode the CU using several intra-prediction modes and select anappropriate intra-prediction mode to use from the tested modes. Forexample, the intra-predictor 222 may calculate rate distortion valuesusing rate-distortion analysis of several tested intra-prediction modes,and may select an intra-prediction mode that has the best ratedistortion characteristics among the tested modes.

The intra-predictor 222 selects one intra-prediction mode from among theplurality of intra-prediction modes, and predicts the CU usingneighboring pixels (reference samples) and an equation which aredetermined according to the selected intra-prediction mode. The syntaxesfor indicating the selected intra-prediction mode are encoded by theencoder 250 and transmitted to the video decoding apparatus. Theintra-prediction mode selected to predict the luma component in the CUmay be used to predict the chroma component. However, the presentdisclosure is not limited thereto. For example, the intra-predictionmode selected for the luma component and a plurality of intra-predictionmodes for the chroma component may be configured as candidates, and oneof the candidates may be used as an intra-prediction mode for the chromacomponent. In this case, the syntax for the intra-prediction modecorresponding to the chroma component is separately signaled.

The inter-predictor 224 generates a prediction block for the CU throughmotion compensation. The inter-predictor searches for a block mostsimilar to the CU in a reference picture encoded and decoded earlierthan the current picture, and generates a prediction block for the CUusing the searched block. Then, the inter-predictor generates a motionvector corresponding to a displacement between the CU in the currentpicture and the prediction block in the reference picture. In general,motion estimation is performed on a luma component, and a motion vectorcalculated based on the luma component is used for both the lumacomponent and the chroma component. The motion information includinginformation about the reference picture and information about a motionvector used to predict the CU is encoded by the encoder 250 andtransmitted to the video decoding apparatus. In general, the informationabout the reference picture means a reference picture index foridentifying the reference picture used for inter-prediction of a CUamong a plurality of reference pictures, and the information about amotion vector means a motion vector difference between an actual motionvector and a predicted motion vector of the CU.

Other methods may be used to minimize the number of bits required toencode motion information. For example, when the reference picture andthe motion vector of the current block are the same as the referencepicture and the motion vector of a neighboring block, the motioninformation about the current block may be transmitted to the decodingapparatus by encoding information for identifying the neighboring block.This method is called a “merge mode.”

In the merge mode, the inter-predictor 224 selects a predeterminednumber of merge candidate blocks (hereinafter referred to as “mergecandidates”) from among the neighboring blocks of the current block. Asillustrated in FIG. 5, as neighboring blocks for deriving mergecandidates, all or part of a left block L, an above block A, an aboveright block AR, a bottom left block BL, and an above left block AL whichare adjacent to the current block in the current picture may be used. Inaddition, a block located within a reference picture (which may be thesame as or different from the reference picture used to predict thecurrent block) other than the current picture in which the current blockis located may be used as a merge candidate. For example, a co-locatedblock which is at the same position as the current block or blocksadjacent to the co-located block in the reference picture may also beused as merge candidates. The inter-predictor 224 configures a mergelist including a predetermined number of merge candidates using suchneighboring blocks. Merge candidates to be used as the motioninformation about the current block are selected from among the mergecandidates included in the merge list, and a merge index for identifyingthe selected candidates is generated. The generated merge index isencoded by the encoder 250 and transmitted to the decoding apparatus.

The subtractor 230 subtracts the prediction pixels in the predictionblock generated by the intra-predictor 222 or the inter-predictor 224from the actual pixels in the CU to generate a residual block.

The transformer 240 transforms residual signals in the residual blockhaving pixel values in the spatial domain into transform coefficients inthe frequency domain. The transformer 240 transforms the residualsignals in the residual block using a transform unit of the CU size. Thequantizer 245 quantizes the transform coefficients output from thetransformer 240 and outputs the quantized transform coefficients to theencoder 250. While it has been described that transformation andquantization of the residual signals are always performed, the presentdisclosure is not limited thereto. Any one or more of transformation andquantization may be selectively skipped. For example, only one oftransformation and quantization may be skipped, or both transformationand quantization may be skipped.

The encoder 250 encodes information such as a CTU size, a QT split flag,a BT_split_flag, and a splitting type, which are associated with blocksplitting, such that the video decoding apparatus may split the block inthe same manner as in the video encoding apparatus.

In addition, the encoder 250 encodes information that is needed for thevideo decoding apparatus to reconstruct the CU and transmits theinformation to the video decoding apparatus. In the present disclosure,the encoder 250 initially encodes prediction syntaxes required topredict the CU. The prediction syntaxes encoded by the encoder 250include a skip flag (skip_flag) indicating whether the CU is encoded ina skip mode. Here, the skip mode is a special case of the merge mode,and is different from the merge mode in that no information about the CUis encoded after the merge index (merge_idx) is encoded. Therefore, inthe skip mode, no transform syntax is coded and all coefficients in theCU are set to 0. When the CU is encoded in the skip mode, the videodecoding apparatus generates a prediction block using the motion vectorand reference picture of the merge candidate indicated by the mergeindex as the motion vector and reference picture of the current CU.Since the residual signals are all set to 0, the prediction block isreconstructed as the CU. In addition, whether to apply deblockingfiltering or SAO filtering on the CU that is encoded in the skip modemay be applied by syntaxes signaled at a higher level (e.g., CTU, slice,PPS, etc.) than the CU. For example, when the syntax (slice_sao_flag)indicating whether to apply the SAO is signaled on a slice-by-slice,whether to apply the SAO to the CUs which are encoded in the skip modein the corresponding slice is determined according to the syntax(slice_sao_flag). Alternatively, at least some in-loop filtering may beskipped when the CU is encoded in the skip mode. For example,transquant_skip_flag, which will be described later, may beautomatically set to 1, and transformation, quantization, and at leastsome in-loop filtering for the CU may be skipped.

When the CU is not encoded in the skip mode, the prediction syntaxesinclude prediction type information (pred_mode_flag) indicating whetherthe CU is encoded by intra-prediction or inter-prediction, andintra-prediction information (that is, information about theintra-prediction mode) or inter-prediction information (informationabout the reference picture and motion vector) according to theprediction type. The inter-prediction information includes a merge flag(merge_flag) indicating whether the reference picture and motion vectorof the CU are encoded in the merge mode, and includes a merge index(merge_idx) when merge_flag is 1, or the picture information and motionvector difference information when merge_flag is 0. In addition, thepredictive motion vector information may be additionally included.

After encoding the prediction syntaxes, the encoder 250 encodestransform syntaxes required to transform the CU. The transform syntaxesinclude information related to selective skipping of transformation andquantization and information about the coefficients in the CU. Here,when there are two or more transform methods, the transform syntaxesinclude information indicating a type of transformation used for the CU.Here, the types of transformation applied to the horizontal axisdirection and the vertical axis direction may be included, respectively.

The information related to selective skipping of transformation andquantization may include a transformation/quantization skip flag(transquant_skip_flag) indicating whether to skip transformation,quantization, and at least some in-loop filtering for a CU, and atransform skip flag (transform_skip_flag) indicating whether to skip thetransformation for each of the luma component and chroma componentsconstituting the CU, respectively. The transform skip flag(transform_skip_flag) is individually coded for each of componentsconstituting the CU. However, the present disclosure is not limitedthereto, and the transform skip flag may be encoded only once for oneCU. In this case, when the transform_skip_flag is 1, transformation onthe CU, that is, transformation on both the luminance and chromacomponents constituting the CU is skipped.

The information related to the selective skipping of transformation andquantization may be represented by one syntax (transquant_idx). In thiscase, the syntax may have four values. For example, transquant_idx=0means that both transformation and quantization are skipped,transquant_idx=1 means that only quantization is performed,transquant_idx=2 means that only transformation is performed, andtransquant_idx=3 means that both transformation and quantization areperformed. This syntax may be binarized using a fixed length (FL)binarization method so that the four values are the same bit. Forexample, it may be binarized as shown in Table 1.

TABLE 1 transquant_idx Transform Quantization Binarization (FL) 0 offoff 00 1 off on 01 2 on off 10 3 on on 11

Alternatively, this syntax may be binarized using a truncated unary (TU)binarization method such that fewer bits are allocated to a value havinga higher probability of occurrence. For example, the probability thatboth transformation and quantization are performed is typically thelargest, followed by the probability that only the quantization isperformed with the transformation skipped. Therefore, the syntax may bebinarized as shown in Table 2.

TABLE 2 transquant_idx Transform Quantization Binarization (TU) 0 Offoff 111 1 off on 10 2 on off 110 3 on on 0

Information about the coefficients in the CU includes coded block flags(cbf) indicating whether non-zero coefficients are present in the lumacomponent and the two chroma components of the CU, and syntaxes forindicating the values of the coefficients. Here, the “coefficients” maybe quantized transform coefficients (when both transformation andquantization are performed), or may be quantized residual signalsobtained by skipping transformation (when the transformation isskipped), or residual signals (when both the transformation and thequantization are skipped).

In the present disclosure, the structure or order in which the encoder250 encodes the prediction syntaxes and transform syntaxes for the CU isthe same as the structure or order in which the decoder 610 of the videodecoding apparatus, which will be described later, decodes the encodedprediction and transform syntaxes. Since the structure or order in whichthe encoder 250 encodes the syntaxes will be clearly understood from thestructure or order in which the decoder 610 decodes the syntaxes,details of the syntax encoding structure or order by the encoder 250 isomitted to avoid redundant description.

The inverse quantizer 260 inversely quantizes the quantized transformcoefficients output from the quantizer 245 to generate transformcoefficients. The inverse transformer 265 transforms the transformcoefficients output from the inverse quantizer 260 from the frequencydomain to the spatial domain and reconstructs the residual block.

The adder 270 adds the reconstructed residual block to the predictionblock generated by the predictor 220 to reconstruct the CU. The pixelsin the reconstructed CU are used as reference samples in performingintra-prediction of the next block in order.

The in-loop filter 280 filters the reconstructed pixels to reduceblocking artifacts, ringing artifacts, and blurring artifacts generateddue to block-based prediction and transformation/quantization. Thein-loop filter 280 may include a deblocking filter 282 and an SAO filter284. The deblocking filter 180 filters the boundary between thereconstructed blocks to remove blocking artifacts generated due toblock-by-block coding/decoding, and the SAO filter 284 performsadditional filtering on the deblocking-filtered picture. The SAO filter284 is used to compensate for a difference between a reconstructed pixeland an original pixel caused by lossy coding. Since the deblockingfilter and SAO are filtering techniques defined in the HEVC standardtechnology, further detailed description thereof is omitted.

The reconstructed blocks filtered through the deblocking filter 282 andthe SAO filter 284 are stored in the memory 290. Once all blocks in onepicture are reconstructed, the reconstructed picture is used as areference picture for inter-prediction of a block in a picture to beencoded.

FIG. 6 is an exemplary block diagram of an video decoding apparatuscapable of implementing the techniques of the present disclosure.

The video decoding apparatus includes a decoder 610 and a reconstructor600. The reconstructor 600 includes an inverse quantizer 620, an inversetransformer 630, a predictor 640, and an adder 650, and an in-loopfilter 660, and a memory 670. Similar to the video encoding apparatus ofFIG. 2, each element of the video decoding apparatus may be implementedas a hardware chip, or may be implemented as software, and one or moremicroprocessors may be implemented to execute the functions of thesoftware corresponding to each element.

The decoder 610 decodes a bitstream received from the video encodingapparatus. The decoder 610 determines a to-be-decoded CU by decodinginformation related to block splitting. The decoder 610 extractsinformation about the CTU size from the sequence parameter set (SPS) orthe picture parameter set (PPS), determines the size of the CTU, andsplits a picture into CTUs of the determined size. Then, the decoderdetermines the CTU as the uppermost layer, that is, the root node, of atree structure, and extracts split information of the CTU to therebysplit the CTU using the tree structure. For example, when the CTU issplit using a QTBT structure, a first flag (QT_split_flag) related tothe QT split is extracted to split each node into four nodes of a lowerlayer. For a node corresponding to the leaf node of the QT, the secondflag (BT_split_flag) and split type (split direction) informationrelated to the BT split are extracted and the corresponding leaf node issplit in the BT structure. As another example, when a CTU is split usingthe QTBTTT structure, the first flag (QT_split_flag) related to the QTsplit is extracted, and each node is split into four sub-nodes of alower layer. In addition, for a node corresponding to a leaf node of QT,split_flag indicating whether the node is further split into BT or TT,split type (or split direction) information and additional informationfor distinguishing the BT structure or the TT structure are extracted.Thereby, each node under the leaf node of QT is recursively split into aBT or TT structure.

The decoder 610 also decodes, from the bitstream, the predictionsyntaxes and transform syntaxes necessary for reconstructing the CU. Inthis operation, the decoder decodes the prediction syntaxes, and thendecodes the transform syntaxes. The structure in which the decoder 610decodes the prediction syntaxes and transform syntaxes will be describedlater with reference to FIG. 7 and subsequent figures.

The inverse quantizer 620 inversely quantizes the coefficients derivedfrom the transform syntaxes. The inverse transformer 630 inverselytransforms the inversely quantized coefficients from the frequencydomain to the spatial domain to reconstruct the residual signals, andthereby generates a residual block for the CU. One or more of theinverse quantization or inverse transformation may be skipped accordingto information related to selective skipping of transformation andquantization included in the transform syntaxes decoded by the decoder.

The predictor 640 generates prediction blocks for the CU using theprediction syntaxes. The predictor 640 includes an intra-predictor 642and an inter-predictor 644. The intra-predictor 642 is activated whenthe prediction type of the CU is the intra-prediction, and theinter-predictor 644 is activated when the prediction type of the CU isthe inter-prediction.

The intra-predictor 642 determines an intra-prediction mode of the CUamong the plurality of intra-prediction modes from the intra-predictioninformation extracted from the decoder 610, and predicts the CU usingreference samples around the CU according to the intra-prediction mode.

The inter predictor 644 determines a motion vector of the CU and areference picture referenced by the motion vector using theinter-prediction information extracted from the decoder 610, andpredicts the CU using the motion vector and the reference picture. Forexample, when merge_flag is 1, after merge_idx is extracted and a mergelist is configured in the same manner as in the image encodingapparatus, the inter predictor 644 sets the motion vector and referencepicture of the current CU into a motion vector and reference picture ofa block indicated by merge_idx among the merge candidates included inthe merge list. On the other hand, when merge_flag is 0, the referencepicture information and the motion vector difference information areextracted from the bitstream to determine the motion vector andreference picture of the current CU. In this case, predictive motionvector information may be additionally extracted.

The adder 650 adds the residual block output from the inversetransformer and the prediction block output from the inter-predictor orintra-predictor to reconstruct the CU. The pixels in the reconstructedCU are utilized as reference samples for intra-prediction of a block tobe decoded later.

By sequentially reconstructing the CUs, a CTU composed of the CUs and apicture composed of CTUs are reconstructed.

The in-loop filter 660 includes a deblocking filter 662 and an SAOfilter 664. The deblocking filter 662 deblock-filters the boundarybetween the reconstructed blocks to remove blocking artifacts generateddue to block-by-block decoding. The SAO filter 664 performs additionalfiltering on the reconstructed blocks after the deblock-filtering tocompensate for the difference between the reconstructed pixels and theoriginal pixels, which results from lossy coding. The reconstructedblocks filtered through the deblocking filter 662 and the SAO filter 664are stored in the memory 670. When all the blocks in one picture arereconstructed, the reconstructed picture is used as a reference picturefor inter-prediction of blocks in a subsequent picture to be decoded.

Hereinafter, a structure or procedure in which the decoder 610 of thevideo decoding apparatus decodes CU syntaxes is described in detail.

As described above, the video decoding apparatus initially decodesprediction syntaxes of the coding unit including a skip_flag(skip_flag). After decoding all the prediction syntaxes, the videodecoding apparatus decodes transform syntaxes including atransquant_skip_flag and coding unit cbf (cbf_cu). Here, cbf_cu is asyntax indicating whether all coefficients in one luma block and twochroma blocks constituting the coding unit are 0. The transform syntaxesare decoded when skip_flag is 0, that is, when the prediction type ofthe current CU is not in the skip mode.

FIG. 7 is an exemplary flowchart for decoding CU syntaxes according tothe present disclosure.

The video decoding apparatus initially decodes skip_flag among otherprediction syntaxes (S702). When skip_flag is 1, no syntax for the CUexcept merge_idx includes in the bitstream, as described above.Accordingly, when skip_flag is 1 (S704), the video decoding apparatusdecodes merge_idx from the bitstream (S706), and ends syntax decodingfor the CU. When the CU has been encoded in the skip mode, whetherdeblocking filtering or SAO filtering is applied to the CU may bedetermined by syntaxes signaled at a higher level (e.g., CTU, slice,PPS, etc.) than the CU. Alternatively, at least some in-loop filteringmay be skipped for the CU which has been encoded in the skip mode. Forexample, transquant_skip_flag may be automatically set to 1, andaccordingly at least some in-loop filtering may be skipped.

When skip_flag is 0 (S704), prediction syntaxes for inter-prediction orintra-prediction are decoded. Initially, the video decoding apparatusdecodes prediction type information (pred_mode_flag) indicating whetherthe prediction type of the current CU is intra-prediction orinter-prediction (S708). When pred_mode_flag indicates intra-prediction,for example, pred_mode_flag=1 (S710), the video decoding apparatusdecodes intra-prediction information indicating the intra-predictionmode of the current CU (S712). On the other hand, when pred_mode_flagindicates inter-prediction, for example, pred_mode_flag=0 (S710), thevideo decoding apparatus decodes merge_flag (S714). Then, whenmerge_flag indicates the merge mode (S716), for example, merge_flag=1,merge_idx is decoded (S718). When merge_flag indicates that the mode isnot the merge mode (S716), for example, merge_flag=0, predictionsyntaxes for normal inter-prediction, that is, reference pictureinformation and a motion vector difference are decoded (S720). In thiscase, predictive motion vector information may be additionally decoded.After decoding all the prediction syntaxes of the current CU in thisway, the video decoding apparatus decodes the transform syntaxes of thecurrent CU.

The video decoding apparatus first decodes cbf_cu indicating whether thecoefficients in one luma block and two chroma blocks constituting a CUare all 0. However, when the prediction type of the current CU isintra-prediction, cbf_cu may be automatically set to 1 without decodingfrom the bitstream (S736). In addition, when the prediction type of thecurrent CU is the skip mode, cbf_cu may be automatically set to 0. Whenthe prediction type is the merge mode, cbf_cu may be automatically setto 1 (S732). When the prediction type of the current CU isinter-prediction and is not the merge mode, cbf_cu is decoded from thebitstream (S734).

After decoding cbf_cu, the video decoding apparatus decodestransquant_skip_flag depending on the value of cbf_cu. For example, whencbf_cu is 0 (S738), it means that non-zero luma components and non-zerochroma components are not present in the CU, and thus the syntaxdecoding for the CU is terminated without further decoding of transformsyntaxes. When cbf_cu is 1 (S738), it means that a luma component orchroma component having a non-zero value is present in the CU, andtherefore transquant_skip_flag is decoded (S740). Subsequently,transform syntaxes for each of the luma and chroma components in the CUare decoded (S742).

Alternatively, the decoding order of cbf_cu and transquant_skip_flag maybe changed. FIG. 8 is another exemplary flowchart for decoding CUsyntaxes according to the present disclosure.

Since the operations S802 to S820 for decoding the prediction syntaxesin FIG. 8 are the same as S702 to S720 for decoding the predictionsyntaxes in FIG. 7, only the operation of decoding the transformsyntaxes of the CU will be described below.

When the prediction type of the current CU is not in the skip mode, thevideo decoding apparatus decodes transquant_skip_flag from the bitstreamafter decoding the prediction syntaxes (S832). cbf_cu is decoded aftertransquant_skip_flag is decoded. For example, when the prediction typeof the current CU is intra-prediction (pred_mode_flag=1) or the currentCU is in the merge mode (merge_flag=1) (S834), cbf_cu is not decodedfrom the bitstream and is automatically set to 1 (S836). On the otherhand, when the prediction type of the current CU is inter-prediction(pred_mode_flag=0) and the current CU is not in the merge mode(merge_flag=0) (S834), cbf_cu is decoded from the bitstream (S838).

Thereafter, when cbf_cu is 1, the video decoding apparatus decodestransform syntaxes for each of the luma and chroma components in the CU(S842).

In the above embodiments, transquant_skip_flag is a syntax indicatingwhether to skip transformation, quantization, and at least some in-loopfiltering for the CU. Here, the “at least some in-loop filtering” mayinclude both deblocking filtering and SAO filtering. Alternatively, itmay mean in-loop filtering except deblocking filtering. in this case,the video decoding apparatus decodes transquant_skip_flag. Whentransquant_skip_flag is 1, the transformation, quantization and SAOfiltering for the CU are skipped. When transquant_skip_flag is 1, thevideo decoding apparatus may further decode a deblocking filter flag(deblocking_filter_flag) indicating whether to perform deblockingfiltering on the CU. In this case, when deblocking_filter_flag is 0, allthe transformation, quantization, deblocking filtering and SAO filteringare skipped for the CU. On the other hand, when deblocking_filter_flagis 1, the transformation, quantization, and SAO filtering are skippedfor the CU and deblocking filtering is performed.

The pixels in the CU are composed of three color components: one lumacomponent (Y) and two chroma components (Cb, Cr). Hereinafter, a blockcomposed of luma components is referred to as a luma block and a blockcomposed of chroma components is referred to as a chroma block. One CUis composed of one luma block and two chroma blocks. The video decodingapparatus described in the present disclosure performs, for each of theluma and chroma blocks constituting the CU, the operation of decodingtransform syntaxes for obtaining coefficients in the CU. For example,this operation corresponds to operation S742 of FIG. 7 or operation S842of FIG. 8. However, it is apparent that decoding the transform syntaxesfor each component is not necessarily performed in combination withFIGS. 7 and 8 and may be applied to a CU syntax structure other than thesyntax structure in FIGS. 7 and 8.

FIG. 9 is an exemplary flowchart for decoding transform syntaxes forrespective luma and chroma components.

The video decoding apparatus decodes, from a bitstream, a first chromacbf (e.g., cbf_cb) indicating whether at least one non-zero coefficientis present in a first chroma block (e.g., a chroma block composed of Cbcomponents) constituting the CU, a second chroma cbf (e.g., cbf_cr)indicating whether at least one non-zero coefficient is present in asecond chroma block (e.g., a chroma block composed of Cr components),and a luma block (cbf_luma) indicating whether at least one non-zerocoefficient is present in the luma block constituting the CU (S902). Thedecoding order of the three component cbf's is not limited, but thethree component cbf's may be decoded, for example, in order of cbf_cb,cbf_cr, and cbf_luma.

When two cbf's decoded first in S902 are 0 (all coefficients in a blockcorresponding to each cbf are 0), the last cbf may not be decoded.Referring to FIG. 7 or 8, when cbf_cu is 1, cbf_cb, cbf_cr, and cbf_lumaare decoded. Therefore, when the cbf's of the two components are all 0,cbf of the other component is necessarily 1.

After the cbf's of the three components are decoded, S904 to S910 areperformed for each component. As an example, for the luma component, thevideo decoding apparatus determines whether cbf_luma=1 (S904). Whencbf_luma=0, this means that there are no non-zero coefficients in theluma block, and thus all values in the luma block are set to 0.

On the other hand, when cbf_luma=1, the video decoding apparatus decodestransform_skip_flag indicating whether transformation for the luma blockis performed. Referring to FIG. 7 or 8, when the decodedtransquant_skip_flag is 1, transformation and quantization for the CU(all components in the CU) are skipped. Accordingly, whentransquant_skip_flag is 1, decoding of transform_skip_flag for the lumacomponent is not required. On the other hand, whentransquant_skip_flag=0, this means that transformation and quantizationfor all components in the CU are not always skipped. Accordingly, whentransquant_skip_flag is 0, the video decoding apparatus decodestransform_skip_flag indicating whether the transformation is performedon the luma component (S906, S908).

Then, the video decoding apparatus decodes the coefficient values forthe luma component from the bitstream (S910).

Decoding cbf's for the three components constituting the CU in S902 hasbeen described. Hereinafter, another embodiment of decoding cbf's forthree components constituting the CU will be described with reference toFIG. 10. In this embodiment, a syntax called cbf_chroma indicatingwhether all coefficients in the two chroma blocks constituting the CU is0 is further defined.

FIG. 10 is an exemplary flowchart for decoding cbf for three componentsconstituting a CU.

The video decoding apparatus decodes cbf_chroma indicating whether allcoefficients in the two chroma blocks constituting the CU are 0 (S1002).

When cbf_chroma is 0 (S1004), cbf's for the two chroma blocks, that is,cbf_cb and cbf_cr are both set to 0 (S1006). Referring to FIG. 7 or 8,cbf's for the three components are decoded when cbf_cu is 1.Accordingly, when cbf_chroma is 0, cbf_luma is automatically set to 1(S1006).

On the other hand, when cbf_chroma is 1, the video decoding apparatusdecodes cbf_cb (S1008). cbf_chroma=1 means that there is a non-zerocoefficient in at least one of the two chroma blocks. Accordingly, whencbf for one of the two chroma blocks is 0, cbf for the other chromablock should be 1. Therefore, when the decoded cbf_cb is 0, cbf_cr isautomatically set to 1 (S1010, S1014). On the other hand, when cbf_cb is1, cbf_cr is decoded from the bitstream (S1012). Here, the decodingorder of cbf_cb and cbf_cr may be changed. When decoding of cbf_cb andcbf_cr is completed, the video decoding apparatus decodes cbf_luma(S1016).

The operations after the decoding of cbf_cb, cbf_cr, and cbf_luma arethe same as those in FIG. 9.

Although exemplary embodiments have been described for illustrativepurposes, those skilled in the art will appreciate that and variousmodifications and changes are possible, without departing from the ideaand scope of the embodiments. Exemplary embodiments have been describedfor the sake of brevity and clarity. Accordingly, one of ordinary skillwould understand that the scope of the embodiments is not limited by theexplicitly described above embodiments but is inclusive of the claimsand equivalents thereto.

What is claimed is:
 1. A method for decoding a video sequence ofpictures, the method comprising: determining a current coding unit to bedecoded among coding units which are divided from a coding tree unit ina current picture by a tree structure; decoding, from a bitstream,syntax elements of a coding unit level related to the current codingunit; and reconstructing the current coding unit using the syntaxelements of the coding unit level, wherein the decoding of the syntaxelements of the coding unit level comprises: decoding prediction syntaxelements for the current coding unit at the coding unit level, whereinthe prediction syntax elements include a skip flag indicating whetherthe current coding unit has been predicted in a skip mode; and after thedecoding of the prediction syntax elements, decoding transform syntaxelements for the current coding unit at the coding unit level, whereinthe transform syntax elements include a single flag of coding unit cbfindicating whether all coefficients in both of a luma block and twochroma blocks constituting the current coding unit are zero, wherein thetransform syntax elements are not decoded until the decoding of theprediction syntax elements is completed, and are not decoded when theskip flag indicates that the current coding unit has been predicted inthe skip mode.
 2. The method of claim 1, wherein the reconstructing ofthe current coding unit comprises: generating a prediction block for thecurrent coding unit from the prediction syntax elements, using a size ofthe current coding unit as a prediction unit size; generating a residualblock for the current coding unit from the transform syntax elements,using the size of the current coding unit as a transform unit size; andreconstructing the current coding unit by adding the prediction block tothe residual block.
 3. The method of claim 1, wherein the decoding ofthe transform syntax elements comprises: decoding the coding unit cbf;and decoding a transformation/quantization skip flag when the codingunit cbf indicates that at least one of coefficients in the luma blockand the two chroma blocks constituting the current coding unit isnon-zero, the transformation/quantization skip flag indicating whetherinverse transformation, inverse quantization, and at least part ofin-loop filterings are skipped.
 4. The method of claim 3, wherein thetransformation/quantization skip flag indicates whether the inversetransformation, the inverse quantization, and an in-loop filteringexcept for deblocking filtering are skipped for the current coding unit.5. The method of claim 4, wherein the decoding of the transform syntaxelements comprises: when the transformation/quantization skip flagindicates that the inverse transformation, the inverse quantization, andthe in-loop filtering except for the deblocking filtering are skippedfor the current coding unit, decoding a deblocking filter flagindicating whether to skip the deblocking filtering for thereconstructed coding unit.
 6. The method of claim 1, wherein, when thecoding unit cbf indicates that at least one of the coefficients in theluma block and the two chroma blocks constituting the current codingunit is non-zero, the decoding of the transform syntax elementscomprises: decoding one of a chroma cbf and a luma cbf; and depending ona value of the decoded one of the chroma cbf and the luma cbf, decodingthe other one of the chroma cbf and the luma cbf, wherein the chroma cbfindicates whether all coefficients in the two chroma blocks are zero,and the luma cbf indicates whether all coefficients in the luma blockare zero.
 7. The method of claim 6, further comprising: when the chromacbf indicates that at least one non-zero coefficient is present in thetwo chroma blocks, decoding a first sub-chroma cbf indicating whetherall coefficients in a first chroma block between the two chroma blocksare zero; and when the first sub-chroma cbf indicates that at least onenon-zero coefficient is present in the first chroma block, decoding asecond sub-chroma cbf indicating whether all coefficients in a secondchroma block between the two chroma blocks are zero.
 8. The method ofclaim 1, wherein, when the skip flag does not indicates that the currentcoding unit has been predicted in the skip mode, the decoding of thetransform syntax elements comprises: when a prediction mode of thecurrent coding unit is neither an intra mode nor a merge mode, decodingthe coding unit cbf from the bitstream, and when the prediction mode ofthe current coding unit is the intra mode or the merge mode, inferringthe coding unit cbf as a value indicating that at least part of the lumablock and the two chroma blocks have a non-zero coefficient, withoutdecoding the coding unit cbf from the bitstream.
 9. The method of claim1, further comprising performing a deblocking-filtering on blockboundaries in a reconstructed image including reconstructed codingunits, wherein reconstructed pixels in a coding unit predicted in theskip mode are deblocking-filtered under control of not a syntax elementof the coding unit level but a syntax element of an upper level than thecoding unit level.
 10. A video encoding apparatus for encoding a videosequence of pictures, the apparatus comprising: an encoder configuredto: determine a current coding unit to be encoded among coding unitswhich are divided from a coding tree unit in a current picture by a treestructure, and encode, into a coding unit level of a bitstream, syntaxelements resulting from encoding of the current coding unit, by:encoding prediction syntax elements for the current coding unit at thecoding unit level, the prediction syntax elements including a skip flagindicating whether the current coding unit is predicted in a skip mode,and encoding, after the encoding of the prediction syntax elements,transform syntax elements for the current coding unit at the coding unitlevel, wherein the transform syntax elements include a single flag ofcoding unit cbf indicating whether all coefficients in both of a lumablock and two chroma blocks constituting the current coding unit arezero; and a reconstructor configured to reconstruct the current codingunit, wherein the transform syntax elements are not encoded until theencoding of the prediction syntax elements is completed, and are notencoded when the skip flag indicates that the current coding unit ispredicted in the skip mode.
 11. The apparatus of claim 10, wherein thereconstructor is configured to: generate a prediction block for thecurrent coding unit from the prediction syntax elements, using a size ofthe current coding unit as a prediction unit size; generate a residualblock for the current coding unit from the transform syntax elements,using the size of the current coding unit as a transform unit size; andreconstruct the current coding unit by adding the prediction block tothe residual block.
 12. The apparatus of claim 10, wherein the encoderencodes a transformation/quantization skip flag when the coding unit cbfindicates that at least one of coefficients in the luma block and thechroma blocks constituting the current coding unit is non-zero, thetransformation/quantization skip flag indicating whether inversetransformation, inverse quantization, and at least part of in-loopfilterings are skipped.
 13. The apparatus of claim 12, wherein thetransformation/quantization skip flag indicates whether the inversetransformation, the inverse quantization, and an in-loop filteringexcept for deblocking filtering are skipped for the current coding unit.14. The apparatus of claim 13, wherein, when thetransformation/quantization skip flag indicates that the inversetransformation, the inverse quantization, and the in-loop filteringexcept for the deblocking filtering are skipped for the current codingunit, the encoder encodes a deblocking filter flag indicating whether toskip the deblocking filtering for the reconstructed coding unit.
 15. Theapparatus of claim 10, wherein, when the coding unit cbf indicates thatat least one of the coefficients in the luma block and the two chromablocks constituting the current coding unit is non-zero, the encoder isconfigured to: encode one of a chroma cbf and a luma cbf; and dependingon a value of the encoded one of the chroma cbf and the luma cbf, encodethe other one of the chroma cbf and the luma cbf, wherein the chroma cbfindicates whether all coefficients in the two chroma blocks are zero,and the luma cbf indicates whether all coefficients in the luma blockare zero.
 16. The apparatus of claim 15, wherein, when the chroma cbfindicates that at least one non-zero coefficient is present in the twochroma blocks, the encoder is configured to: encode a first sub-chromacbf indicating whether all coefficients in a first chroma block betweenthe two chroma blocks are zero; and encode, when the first sub-chromacbf indicates that at least one non-zero coefficient is present in thefirst chroma block, a second sub-chroma cbf indicating whether allcoefficients in a second chroma block between the two chroma blocks arezero.
 17. The apparatus of claim 10, wherein, when the skip flag doesnot indicates that the current coding unit has been predicted in theskip mode, the encoder is configured to: encode the coding unit cbf,when a prediction mode of the current coding unit is neither an intramode nor a merge mode, wherein, when the prediction mode of the currentcoding unit is the intra mode or the merge mode, the coding unit cbf isnot encoded such that a value thereof is inferred as a value indicatingthat at least part of the luma block and the two chroma blocks have anon-zero coefficient.
 18. The apparatus of claim 10, wherein thereconstructor performs a deblocking-filtering on block boundaries in areconstructed image including reconstructed coding units, whereinreconstructed pixels in a coding unit predicted in the skip mode aredeblocking-filtered under control of not a syntax element of the codingunit level but a syntax element of an upper level than the coding unitlevel.
 19. A non-transitory recording medium storing a bitstreamgenerated by a method of encoding a video sequence of pictures, themethod comprising: determining a current coding unit to be encoded amongcoding units which are divided from a coding tree unit in a currentpicture by tree structure; and encoding, into a coding unit level of abitstream, syntax elements resulting from encoding of the current codingunit, by: encoding prediction syntax elements for the current codingunit into the coding unit level, the prediction syntax elementsincluding a skip flag indicating whether the current coding unit ispredicted in a skip mode; and encoding, after the encoding of theprediction syntax elements, transform syntax elements for the currentcoding unit into the coding unit level, wherein the transform syntaxelements include a single flag of coding unit cbf indicating whether allcoefficients in both of a luma block and two chroma blocks constitutingthe current coding unit are zero; and wherein the transform syntaxelements are not encoded until the encoding of the prediction syntaxelements is completed, and are not encoded when the skip flag indicatesthat the current coding unit is predicted in the skip mode.